A Hardware-Efficient Massive MIMO Detector Using Improved Quasi-Newton Method

نویسندگان

چکیده

The quasi-newton methods are one of the most effective for solving unconstrained optimization problems. This letter provides a hardware-efficient massive multiple-input multiple-output (MIMO) detector using an improved (IQN) method. Due to similarity in stepsize calculation Barzilai-Borwein and limited-memory BFGS, two deeply fused proposed IQN algorithm higher convergence speed. corresponding efficient architecture is also given, which dual-track systolic array employed diminish number required Processing Elements (PE) by nearly half with less computational delay. Furthermore, approximate divider based on Goldschmidt method designed further reduce hardware overhead. Simulation results show that achieves better Bit-Error-Ratio (BER) performance under different antenna configurations, FPGA implementation validate superiority terms efficiency over state-of-the-art (SOTA) detectors.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Is Massive MIMO Energy Efficient?

Massive multi-input multi-output (MIMO) can support high spectral efficiency (SE) with simple linear transceivers, and is expected to provide high energy efficiency (EE). In this paper, we analyze the EE of downlink multi-cell massive MIMO systems under spatially correlated channel model, where both transmit and circuit power consumptions, training overhead, channel estimation and pilot contami...

متن کامل

Quasi - Newton Trust - Region Method

The classical trust-region method for unconstrained minimization can be augmented with a line search that finds a point that satisfies the Wolfe conditions. One can use this new method to define an algorithm that simultaneously satisfies the quasi-Newton condition at each iteration and maintains a positive-definite approximation to the Hessian of the objective function. This new algorithm has s...

متن کامل

A quasi-Newton proximal splitting method

A new result in convex analysis on the calculation of proximity operators in certain scaled norms is derived. We describe efficient implementations of the proximity calculation for a useful class of functions; the implementations exploit the piece-wise linear nature of the dual problem. The second part of the paper applies the previous result to acceleration of convex minimization problems, and...

متن کامل

A parameterized Newton method and a quasi-Newton method for nonsmooth equations

This paper presents a parameterized Newton method using generalized Jacobians and a Broyden-like method for solving nonsmooth equations. The former ensures that the method is well-deened even when the generalized Jacobian is singular. The latter is constructed by using an approximation function which can be formed for nonsmooth equations arising from partial diierential equations and nonlinear ...

متن کامل

An improved inexact Newton method

For unconstrained optimization, an inexact Newton algorithm is proposed recently, in which the preconditioned conjugate gradient method is applied to solve the Newton equations. In this paper, we improve this algorithm by efficiently using automatic differentiation and establish a new inexact Newton algorithm. Based on the efficiency coefficient defined by Brent, a theoretical efficiency ratio ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Electronics Express

سال: 2023

ISSN: ['1349-2543', '1349-9467']

DOI: https://doi.org/10.1587/elex.20.20230281